Iterated Regret Minimization in Voting Games
نویسندگان
چکیده
The game-theoretic solution concept Iterated Regret Minimization (IRM) was introduced recently by Halpern and Pass. We give the first application of IRM to simultaneous voting games. We study positional scoring rules in detail and give theoretical results demonstrating the bias of IRM toward sincere voting. We present comprehensive simulation results of the effect on social welfare of IRM compared to both sincere and optimal voting. The results fit into a broader research theme of the welfare consequences of strategic voting .
منابع مشابه
Iterated Regret Minimization in Game Graphs
Iterated regret minimization has been introduced recently by J.Y. Halpern and R. Pass in classical strategic games. For many games of interest, this new solution concept provides solutions that are judged more reasonable than solutions offered by traditional game concepts – such as Nash equilibrium –. In this paper, we investigate iterated regret minimization for infinite duration two-player qu...
متن کاملIterated Regret Minimization: A New Solution Concept
For some well-known games, such as the Traveler’s Dilemma or the Centipede Game, traditional gametheoretic solution concepts—most notably Nash equilibrium—predict outcomes that are not consistent with empirical observations. We introduce a new solution concept, iterated regret minimization, which exhibits the same qualitative behavior as that observed in experiments in many games of interest, i...
متن کاملIterated Regret Minimization: A More Realistic Solution Concept
For some well-known games, such as the Traveler’s Dilemma or the Centipede Game, traditional game-theoretic solution concepts—and most notably Nash equilibrium—predict outcomes that are not consistent with empirical observations. In this paper, we introduce a new solution concept, iterated regret minimization, which exhibits the same qualitative behavior as that observed in experiments in many ...
متن کاملDynamic Epistemic Characterizations for IERS
The iterated regret minimization solution exhibits the good qualitative behavior as that observed in experiments in many games that have proved problematic for Nash Equilibrium(NE). It is worthy exploring epistemic characterizations unearthing players’rationality for an algorithm of Iterated Eliminations Regret-dominated Strategy (IERS) related to the solution. In this paper, based on the dynam...
متن کاملThe convex optimization approach to regret minimization
A well studied and general setting for prediction and decision making is regret minimization in games. Recently the design of algorithms in this setting has been influenced by tools from convex optimization. In this chapter we describe the recent framework of online convex optimization which naturally merges optimization and regret minimization. We describe the basic algorithms and tools at the...
متن کامل